A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants
نویسنده
چکیده
We describe a CCA-secure public-key encryption scheme, in the Cramer-Shoup paradigm, based on the Linear assumption of Boneh, Boyen, and Shacham. Through a comparison to the Kiltz tag-encryption scheme from TCC 2006, our scheme gives evidence that the CramerShoup paradigm yields CCA encryption with shorter ciphertexts than the Canetti-Halevi-Katz paradigm. We present a generalization of the Linear assumption into a family of progressively weaker assumptions and show how to instantiate our Linear Cramer-Shoup encryption using the progressively weaker members of this family.
منابع مشابه
ElGamal and Cramer - Shoup Variants with Anonymity Using Different Groups ( Extended
In this paper, we have proposed new variants of the El-Gamal and the Cramer-Shoup encryption schemes. In our schemes, the anonymity property holds even if each user chooses an arbitrary prime q where |q| = k and p = 2q + 1 is also prime. More precisely, our El-Gamal variants provide anonymity against the chosen-plaintext attack, and our Cramer-Shoup variants provide anonymity against the adapti...
متن کاملA Cramer-Shoup Variant Related to the Quadratic Residuosity Problem
At Eurocrypt ’02 Cramer and Shoup [7] proposed a general paradigm to construct practical public-key cryptosystems secure against the adaptive chosen ciphertext attack as well as several concrete examples. Using the construction, we present a new variant of the Cramer-Shoup encryption scheme, which is secure against the adaptive chosen ciphertext attack. Our variant is based on the problem relat...
متن کاملAn instantiation of the Cramer-Shoup encryption paradigm using bilinear map groups
A new instantiation of the Cramer-Shoup paradigm for secure encryption is presented, which is built using bilinear map groups. The security is based on the Bilinear Decisional Diffie-Hellman assumption. The recent efficiency improvements introduced in [KD04,GS04] are also applied to our constructions. One of the schemes thereby obtained presents efficiency similar to the most efficient encrypti...
متن کاملUsing Hash Functions as a Hedge against Chosen Ciphertext Attack
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decisional Diffie-Hellman assumption is true. Although this is a reasonable intractability assumption, it would be preferable to base a security proof on a weaker assumption, such as the Computational Diffie-Hellman assumption...
متن کاملProvably Secure Length-saving Public-key Encryption Scheme under the Computational Diie-hellman Assumption
A design of secure and eecient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on the weaker computational assumption have been proposed. For instance, security of the ElGamal variant of Fujisaki-Okamo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007